Nash Equilibria with Minimum Potential in Undirected Broadcast Games
نویسندگان
چکیده
In this paper, we consider undirected network design games with fair cost allocation. We introduce two concepts Potential-Optimal Price of Anarchy (POPoA) and Potential-Optimal Price of Stability (POPoS), where POPoA is the ratio between the worst cost of Nash equilibria with optimal potential and the minimum social cost, and POPoS is the ratio between the best cost of Nash equilibria with optimal potential and the minimum social cost, and show that • The POPoA and POPoS for undirected broadcast games with n players are O( √ logn). • The POPoA and POPoS for undirected broadcast games with |V | vertices are O(log |V |). • There exists an undirected broadcast game with n players such that POPoA, POPoS = Ω( √ log log n). • There exists an undirected broadcast game with |V | vertices such that POPoA,POPoS = Ω(log |V |).
منابع مشابه
Minimum-Effort Coordination Games: Stochastic Potential and Logit Equilibrium
This paper revisits the minimum-effort coordination game with a continuum of Paretoranked Nash equilibria. Noise is introduced via a logit probabilistic choice function. The resulting logit equilibrium distribution of decisions is unique and maximizes a stochastic potential function. In the limit as the noise vanishes, the distribution converges to an outcome that is analogous to the risk-domin...
متن کاملThe Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open question. Specifically we prove that when the cost functions have the form f(x) = cr/x (Fair Cost Allocation) then it is PLS-complete to compute a Pure Nash Equilibrium even in the case where strategies of the players ar...
متن کاملPrice of Stability in Games of Incomplete Information
We address the question of whether price of stability results (existence of equilibria with low social cost) are robust to incomplete information. We show that this is the case in potential games, if the underlying algorithmic social cost minimization problem admits a constant factor approximation algorithm via strict cost-sharing schemes. Roughly, if the existence of an α-approximate equilibri...
متن کاملNash Propagation for Loopy Graphical Games
We introduce NashProp, an iterative and local message-passing algorithm for computing Nash equilibria in multi-player games represented by arbitrary undirected graphs. We provide a formal analysis and experimental evidence demonstrating that NashProp performs well on large graphical games with many loops, often converging in just a dozen iterations on graphs with hundreds of nodes. NashProp gen...
متن کاملDesigning Network Protocols for Good Equilibria
Designing and deploying a network protocol determines the rules by which end users interact with each other and with the network. We consider the problem of designing a protocol to optimize the equilibrium behavior of a network with selfish users. We consider network costsharing games, where the set of Nash equilibria depends fundamentally on the choice of an edge cost-sharing protocol. Previou...
متن کامل